Reactive Search , a history - based heuristicfor MAX { SAT
نویسنده
چکیده
The Reactive Search (RS) method proposes the integration of a simple history-based feedback scheme into local search for the on-line determination of free parameters. In this paper a new RS algorithm is proposed for the approximated solution of the Maximum Satissability problem: a component based on local search with temporary prohibitions is complemented with a reactive scheme that determines (\learns") the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory (algorithm H-RTS). In addition, the non-oblivious functions recently introduced in the framework of approximation algorithms are used to discover a better local optimum in the initial part of the search. The algorithm is developed in two phases. First the bias-diversiication properties of individual candidate components are analyzed by extensive empirical evaluation, then a reactive scheme is added to the winning component, based on Tabu Search. The nal tests on a benchmark of random MAX{3{SAT and MAX{4{SAT problems demonstrate the superiority of H-RTS with respect to alternative heuristics.
منابع مشابه
Reactive search for MAX-SAT: diversification-bias properties with prohibitions and penalties
Many incomplete approaches for SAT and MAX-SAT have been proposed in the last years. The objective of this investigation is not so much horse-racing (beating the competition on selected benchmarks) but understanding the qualitative differences between the various approaches by analyzing simplified versions thereof. In particular, we focus on reactive search schemes where task-dependent and loca...
متن کاملReinforcement Learning and Reactive Search: an adaptive MAX-SAT solver
This paper investigates Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular, a novel application of RL is proposed in the Reactive Tabu Search (RTS) scheme, where the appropriate amount of diversification in prohibition-based local search is adapted in a fast online manner to the characteristics of a task and of the local config...
متن کاملPenalties may have collateral effects . A MAX - SAT analysis
Many incomplete approaches for MAX-SAT have been proposed in the last years. The objective of this investigation is not so much horse-racing (beating the competition on selected benchmarks) but understanding the qualitative differences between the various methods. In particular, we focus on reactive search schemes where taskdependent and local properties in the configuration space are used for ...
متن کاملAdaptive memory-based local search for MAX-SAT
Many real world problems, such as circuit designing and planning, can be encoded into the maximum satisfiability problem (MAX-SAT). To solve MAXSAT, many effective local search heuristic algorithms have been reported in the literature. This paper aims to study how useful information could be gathered during the search history and used to enhance local search heuristic algorithms. For this purpo...
متن کاملSolving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based on formula compilation that allows it to search in a reduced search space. We study how additional techniques from the SAT and Max-SAT literature affect the performance of Clone on problems from the evaluation. We then ...
متن کامل